| Name : perl-Tree-Trie
| |
| Version : 1.2
| Vendor : Mandriva
|
| Release : 2mdv2007.0
| Date : 2006-08-31 09:28:27
|
| Group : Development/Perl
| Source RPM : perl-Tree-Trie-1.2-2mdv2007.0.src.rpm
|
| Size : 0.04 MB
| |
| Packager : Guillaume Rousse < guillomovitch_mandriva_org>
| |
| Summary : A data structure optimized for prefix lookup
|
Description :
This module implements a trie data structure. The term \"trie\"
comes from the word retrieval, but is generally pronounced like
\"try\". A trie is a tree structure (or directed acyclic graph),
the nodes of which represent letters in a word. For example, the
final lookup for the word \'bob\' would look something like
\"$ref->{\'b\'}{\'o\'}{\'b\'}{HASH(0x80c6bbc)}\" (the HASH being an end
marker). Only nodes which would represent words in the trie
exist, making the structure slightly smaller than a hash of the
same data set.
The advantages of the trie over other data storage methods is that lookup times
are O(1) WRT the size of the index. For sparse data sets, it is probably not as
efficient as performing a binary search on a sorted list, and for small files,
it has a lot of overhead. The main advantage (at least from my perspective) is
that it provides a relatively cheap method for finding a list of words in a
large, dense data set which begin with a certain string.
As of version 0.3 of this module, the term \"word\" in this documentation can
refer to one of two things: either a refeence to an array of strings, or a
scalar which is not an array ref. In the case of the former, each element of
the array is treated as a \"letter\" of the \"word\". In the case of the latter,
the scalar is evaluated in string context and it is split into its component
letters. Return values of methods match the values of what is passed in --
that is, if you call lookup() with an array reference, the return value will be
an array reference (if appropriate).
|
RPM found in directory: /vol/rzm6/linux-mandriva/official/2007.0/i586/media/contrib/release |
